On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem
نویسندگان
چکیده
منابع مشابه
On Cyber Attacks and the Maximum-Weight Rooted-Subtree Problem
This paper makes three contributions to cyber-security research. First, we define a model for cyber-security systems and the concept of a cyber-security attack within the model’s framework. The model highlights the importance of game-over components—critical system components which if acquired will give an adversary the ability to defeat a system completely. The model is based on systems that u...
متن کاملThe complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
This paper makes three contributions to cyber-security research. First, we define a model for cyber-security systems and the concept of a cyber-security attack within the model’s framework. The model highlights the importance of game-over components—critical system components which if acquired will give an adversary the ability to defeat a system completely. The model is based on systems that u...
متن کاملThe Rooted Maximum Node-Weight Connected Subgraph Problem
Given a connected node-weighted (di)graph, with a root node r, and a (possibly empty) set of nodes R, the Rooted Maximum NodeWeight Connected Subgraph Problem (RMWCS) is the problem of finding a connected subgraph rooted at r that connects all nodes in R with maximum total weight. In this paper we consider the RMWCS as well as its budget-constrained version, in which also non-negative costs of ...
متن کاملOn the Maximum Common Embedded Subtree Problem for Ordered Trees
The maximum common embedded subtree problem, which generalizes the minor containment problem on trees, is reduced for ordered trees to a variant of the longest common subsequence problem. While the maximum common embedded subtree problem is known to be APX-hard for unordered trees, an exact solution for ordered trees can be found in polynomial time. In this paper, the longest common balanced se...
متن کاملAn improved bound on the maximum agreement subtree problem
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2016
ISSN: 0324-721X
DOI: 10.14232/actacyb.22.3.2016.3